Interprocedural Data Flow Based Optimizations for Distributed Memory Compilation
نویسندگان
چکیده
Data parallel languages like High Performance Fortran (HPF) are emerging as the architecture independent mode of programming distributed memory parallel machines. In this paper, we present the interprocedural optimizations required for compiling applications having irregular data access patterns, when coded in such data parallel languages. We have developed an Interprocedural Partial Redundancy Elimination (IPRE) algorithm for optimized placement of runtime preprocessing routine and collective communication routines inserted for managing communication in such codes. We also present three new interprocedural optimizations: placement of scatter routines, deletion of data structures and use of coalescing and incremental routines. We then describe how program slicing can be used for further applying IPRE in more complex scenarios. We have done a preliminary implementation of the schemes presented here using the Fortran D compilation system as the necessary infrastructure. We present experimental results from two codes compiled using our system to demonstrate the eecacy of the presented schemes.
منابع مشابه
IN and OUT Array Region Analyses
In order to perform powerful program optimizations an exact interprocedural analysis of array data ow is needed For that purpose two new types of array region are introduced IN and OUT regions represent the sets of array elements the values of which are imported to or exported from the current statement or procedure Among the various applications are compilation of communications for message pa...
متن کاملInterprocedural Compilation of Fortran D (extended Version) Interprocedural Compilation of Fortran D
Fortran D is a version of Fortran extended with data decomposition speciications. It is designed to provide a machine-independent programming model for data-parallel applications and has heavily innuenced the design of High Performance Fortran (HPF). In previous work we described Fortran D compilation algorithms for individual procedures. This paper presents an interprocedural approach to analy...
متن کاملInterprocedural Partial Redundancy Elimination With Application to Distributed Memory Compilation
متن کامل
The Pandore data-parallel compiler and its portable runtime
The difficulty of p rogramming massively parallel architectures with distributed memory is a severe impediment to the use of these parallel machines. In the past few years, we have witnessed a substantial effort on the part of researchers to define parallel p rogramming paradigms adapted to Distributed Memory Parallel Computers (DMPCs). Among then J, the Data Parallel model is an interesting ap...
متن کاملDemand-driven Inlining in a Region-based Optimizer for ILP Architectures
Region-based compilation repartitions a program into more desirable compilation units using profiling information and procedure inlining to enable region formation analysis. Heuristics play a key role in determining when it is most beneficial to inline procedures during region formation. An ILP optimizing compiler using a region-based approach restructures a program to better reflect dynamic be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Softw., Pract. Exper.
دوره 27 شماره
صفحات -
تاریخ انتشار 1997